On a sparse random graph with minimum degree three: Likely Posa’s sets are large
نویسندگان
چکیده
We consider the likely size of the endpoint sets produced by Posa rotations, when applied to a longest path in a random graph with cn, c ≥ 2.7 edges that is conditioned to have minimum degree at least three.
منابع مشابه
On a sparse random graph with minimum degree three: Likely Pósa sets are large
We consider the likely size of the endpoint sets produced by Posa rotations, when applied to a longest path in a random graph with cn, c ≥ 2.7 edges that is conditioned to have minimum degree at least three.
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملAn almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G = Gδ≥3 n,m. In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in O(n) time and succeeds w.h.p.
متن کاملSub–optimality of local algorithms on sparse random graphs by
Sub–optimality of local algorithms on sparse random graphs Mustazee Rahman Doctor of Philosophy Graduate Department of Mathematics University of Toronto 2015 This thesis studies local algorithms for solving combinatorial optimization problems on large, sparse random graphs. Local algorithms are randomized algorithms that run in parallel at each vertex of a graph by using only local information ...
متن کاملCores and Connectivity in Sparse Random Graphs
We consider k-connectivity in a sparse random graph with a specified degree sequence. When dealing with sparse random graphs, properties that require connectivity are most appropriately phrased in terms of a giant subgraph that satisfies that property since a sparse random graph is generally not connected. Here a giant subgraph is one that contains a constant fraction of the vertices in the ori...
متن کامل